Optimasi Cost pada Open Shortest Path First di Jaringan Software Defined-Network
نویسندگان
چکیده
منابع مشابه
Open shortest path first routing under random early detection
In this paper we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this paper we only require a single network path be available between each origin and destination, a simplification of the OSPF protocol. We formulate a mixed integer nonlinea...
متن کاملShortest-path network interdiction
We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget. We formulate this bilevel, max–min problem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decomposition a...
متن کاملController Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملShortest Path Using Neural Network
Shortest path problem is solved by using the famous Dijkstra's algorithm, which would quickly provide a global optimization solution in most instances. But when the weight is not given, this method does not work. This research paper examines and analyzes the use of neural networks for finding the weights. A neural network is an artificial representation of human brain that tries to simulate the...
متن کاملCost allocation in shortest path games
A class of cooperative games arising from shortest path problems is deened. These shortest path games are shown to be totally balanced and allow a population-monotonic allocation scheme. Possible methods for obtaining core elements are indicated; rst, by relating to the allocation rules in taxation and bankruptcy problems, second, by constructing an explicit rule that takes opportunity costs in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Techno.Com
سال: 2017
ISSN: 2356-2579,1412-2693
DOI: 10.33633/tc.v16i4.1532